Experience with Implementing Timewarp on Shared Memory Computers

نویسندگان

  • John G. Cleary
  • Steve Franks
  • Fabian Gomes
  • Husam Kinawi
  • Brian W. Unger
  • Zhonge Xiao
چکیده

The use of shared memory computers to implement the TimeWarp algorithm for distributed discrete event simulation is discussed. Actual experience on an implementation for the KSR-1 is described and compared with another implementation on explicit message passing machines. Modifications necessary to achieve good speedup are described. Performance results on the KSR-1 and on the SPARCServer-1000 are reported.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The architecture of an optimistic CPU: the WarpEngine

The architecture for a shared memory CPU is described. The CPU allows for parallelism down to the level of single instructions and is tolerant of memory latency. All executable instructions and memory accesses are time stamped. The TimeWarp algorithm is used for managing synchronisation. This algorithm is optimistic and requires that all computations can be rolled back. The basic functions requ...

متن کامل

A Comparison of Shared Virtual Memory and Message Passing Programming Techniques Based on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

Fast Message Passing via the ALLCACHE Memory on KSR Computers

A large body of applications have been built which use a message-passing style of inter-process communication. Thus, it is important to be able to support eecient message-passing even on shared-memory computers. Unfortunately, `direct' porting of message-passing packages to shared-memory computers invariably produces unacceptably poor performance. In this paper, we discuss schemes for eeciently...

متن کامل

A Technique for the Distributed Simulation of Parallel Computers

A new technique for the efficient asynchronous discrete eventdriven simulation of parallel shared-memory computers is proposed. Our execution-driven methodology, while introducing minimal synchronization overhead to maintain a coherent distributed event causality relation, allows complete virtualization of the design at all levels and therefore is very flexible. We give a detailed description o...

متن کامل

Subjective and behavioral presence measurement and interactivity in the collaborative augmented reality game TimeWarp

Presence measurements are traditionally using a variety of subjective and objective measures. However, constraints often result in subjective measurements using questionnaires as a key method of data collection. In this paper we present a study of 44 participants of a collaborative augmented reality game known as TimeWarp which used both subjective and objective behavioral measures where both v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994